Recursive coalgebras from comonads
نویسندگان
چکیده
We discuss Osius’s [22] concept of a recursive coalgebra of a functor from the perspective of programming semantics and give some new sufficient conditions for the recursiveness of a functor-coalgebra that are based on comonads, comonad-coalgebras and distributive laws.
منابع مشابه
Dualising Initial Algebras
Whilst the relationship between initial algebras and monads is well understood, the relationship between final coalgebras and comonads is less well explored. This paper shows that the problem is more subtle than might appear at first glance: final coalgebras can form monads just as easily as comonads, and, dually, initial algebras form both monads and comonads. In developing these theories we s...
متن کاملTaking Updates Seriously
We show how “taking updates seriously” leads from state-based lenses to update lenses and further; we witness a little hierarchy of types of lens that arises in a systematic way. Lenses of each type are characterized either as coalgebras of certain types of comonads or morphisms between certain types of comonads. In each case, a lens is simulation between two transition systems for suitable not...
متن کاملCovarieties of Coalgebras: Comonads and Coequations
Coalgebras provide effective models of data structures and state-transition systems. A virtual covariety is a class of coalgebras closed under coproducts, images of coalgebraic morphisms, and subcoalgebras defined by split equalisers. A covariety has the stronger property of closure under all subcoalgebras, and is behavioural if it is closed under domains of morphisms, or equivalently under ima...
متن کاملA comonadic account of behavioural covarieties of coalgebras
A class K of coalgebras for an endofunctor T : Set→ Set is a behavioural covariety if it is closed under disjoint unions and images of bisimulation relations (hence closed under images and domains of coalgebraic morphisms, including subcoalgebras). K may be thought of as the class of all coalgebras that satisfy some computationally significant property. In any logical system suitable for specif...
متن کاملChu I: Cofree Equivalences, Dualities and *-Autonomous Categories
Received We study three comonads derived from the comma construction. The induced coalgebras correspond to the three concepts displayed in the title of the paper. The comonad that yields the-autonomous categories is, in essence, the Chu construction, which has recently awaken much interest in computer science. We describe its couniversal property. It is right adjoint to the inclusion of-autonom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 204 شماره
صفحات -
تاریخ انتشار 2004